Sweep Algorithms for Constructing Higher-Dimensional Constrained Delaunay Triangulations
نویسنده
چکیده
I discuss algorithms for constructing constrained Delaunay triangulations (CDTs) in dimensions higher than two. If the CDT of a set of vertices and constraining simplices exists, it can be constructed in O(nvns) time, where nv is the number of input vertices and ns is the number of output d-simplices. The CDT of a starshaped polytope can be constructed in O(ns log nv) time, yielding an efficient way to delete a vertex from a CDT.
منابع مشابه
Constrained Delaunay Triangulations and Algorithms
Two-dimensional constrained Delaunay triangulations (of a planar straight-linegraph) introduced independently by Lee et al. [2] and Chew [1] are well studied struc-tures and can be constructed in optimal time. However, the generalization of suchobjects to three and higher dimensions is much less discussed in literature.In this talk, we first define a constrained Delaunay tri...
متن کاملGeneral-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of user-specified domains, they have “nicely shaped” triangles that optimize several criteria, and they are easy to construct and update. The present work generalizes constrained Delaunay triangulations (CDTs) to higher dimensions, a...
متن کاملThree-Dimensional Constrained Delaunay Triangulation: a Minimalist Approach
In this paper we summarize our experiences with 3D constrained Delaunay triangulation algorithms for industrial applications. In addition, we report a robust implementation process for constructing 3D constrained triangulations from initial unconstrained triangulations, based on a minimalist approach, in which we minimize the use of geometrical operations such as intersections. This is achieved...
متن کاملTowards a Definition of Higher Order Constrained Delaunay Triangulations
When a triangulation of a set of points and edges is required, the constrained Delaunay triangulation is often the preferred choice because of its well-shaped triangles. However, in applications like terrain modeling, it is sometimes necessary to have flexibility to optimize some other aspect of the triangulation, while still having nicely-shaped triangles and including a set of constraints. Hi...
متن کاملConstruction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
Three-dimensional Delaunay triangulations are the most common form of three-dimensional triangulations known, but they are not very suitable for tetrahedral nite element meshes because they tend to contain poorly-shaped sliver tetrahedra. In this paper, we present an algorithm for constructing improved-quality triangulations with respect to a tetrahedron shape measure. This algorithm uses combi...
متن کامل